oracle turing machine造句

Thus, for any oracle O, the halting problem for oracle Turing machines with an oracle to O is not O-computable.
Recursion theory in mathematical logic has traditionally focused on " relative computability ", a generalization of Turing computability defined using oracle Turing machines, introduced by Turing ( 1939 ).
An oracle Turing machine is a hypothetical device which, in addition to performing the actions of a regular Turing machine, is able to ask questions of an " oracle ", which is a particular set of natural numbers.
Given a set " A ", the " Turing jump " of " A " is a set of natural numbers encoding a solution to the halting problem for oracle Turing machines running with oracle " A ".
It's difficult to find oracle turing machine in a sentence. 用oracle turing machine造句挺难的